A polynomial time algorithm for computing the area under a GDT curve
نویسندگان
چکیده
منابع مشابه
A polynomial - time algorithm for computing a shortest path
In this paper, we consider the problem of computing a shortest path of bounded curvature amidst obstacles in the plane. More precisely, given prescribed initial and nal conngurations (i.e. positions and orientations) and a set of obstacles in the plane, we want to compute a shortest C 1 path joining those two conngurations, avoiding the obstacles, and with the further constraint that, on each C...
متن کاملa time-series analysis of the demand for life insurance in iran
با توجه به تجزیه و تحلیل داده ها ما دریافتیم که سطح درامد و تعداد نمایندگیها باتقاضای بیمه عمر رابطه مستقیم دارند و نرخ بهره و بار تکفل با تقاضای بیمه عمر رابطه عکس دارند
A Polynomial Time Algorithm for Finding Area-Universal Rectangular Layouts
A rectangular layout L is a rectangle partitioned into disjoint smaller rectangles so that no four smaller rectangles meet at the same point. Rectangular layouts were originally used as floorplans in VLSI design to represent VLSI chip layouts. More recently, they are used in graph drawing as rectangular cartograms. In these applications, an area a(r) is assigned to each rectangle r, and the act...
متن کاملA polynomial-time algorithm for computing absolutely normal numbers
We give an algorithm to compute an absolutely normal number so that the first i digits in its binary expansion are obtained in time polynomial in i; in fact, just above quadratic. The algorithm uses combinatorial tools to control divergence from normality. Speed of computation is achieved at the sacrifice of speed of convergence to normality.
متن کاملA SIMPLE ALGORITHM FOR COMPUTING TOPOLOGICAL INDICES OF DENDRIMERS
Dendritic macromolecules’ have attracted much attention as organic examples of well-defined nanostructures. These molecules are ideal model systems for studying how physical properties depend on molecular size and architecture. In this paper using a simple result, some GAP programs are prepared to compute Wiener and hyper Wiener indices of dendrimers.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms for Molecular Biology
سال: 2015
ISSN: 1748-7188
DOI: 10.1186/s13015-015-0058-0